A new lower bound on upper irredundance in the queens’ graph
نویسندگان
چکیده
منابع مشابه
A new lower bound on upper irredundance in the queens' graph
The queens’ graph Qn has the squares of the n × n chessboard as its vertices, with two squares adjacent if they are in the same row, column, or diagonal. An irredundant set of queens has the property that each queen in the set attacks at least one square which is attacked by no other queen. IR(Qn) is the cardinality of the largest irredundant set of vertices in Qn. Currently the best lower boun...
متن کاملA lower bound for the CO-irredundance number of a graph
This paper establishes a necessary and sufficient condition for a CO-irredundant set of vertices of a graph to be maximal and shows that the smallest cardinality of a maximal CO-irredundant set in an n vertex graph with maximum degree is bounded below by n/2 for = 2, 4n/13 for = 3 and 2n/(3 − 3) for 4. This result is best possible and extremal graphs are characterised for 3. © 2005 Elsevier B.V...
متن کاملA lower bound for the irredundance number of trees
Let ir(G) and γ(G) be the irredundance number and domination number of a graph G, respectively. The number of vertices and leafs of a graph G is denoted by n(G) and n1(G). If T is a tree, then Lemańska [4] presented in 2004 the sharp lower bound γ(T ) ≥ n(T ) + 2− n1(T ) 3 . In this paper we prove ir(T ) ≥ n(T ) + 2− n1(T ) 3 for an arbitrary tree T . Since γ(T ) ≥ ir(T ) is always valid, this ...
متن کاملKernelization: New Upper and Lower Bound Techniques
In this survey, we look at kernelization: algorithms that transform in polynomial time an input to a problem to an equivalent input, whose size is bounded by a function of a parameter. Several results of recent research on kernelization are mentioned. This survey looks at some recent results where a general technique shows the existence of kernelization algorithms for large classes of problems,...
متن کاملNew Upper and Lower Bound Sifting Iterations
with fκ(s) as large as possible (resp. Fκ(s) as small as possible) given that the above inequality holds for all choices of A satisfying (1). Selberg [3] has shown (in a much more general context) that the functions fκ(s), Fκ(s) are continuous, monotone, and computable for s > 1, and that they tend to 1 exponentially as s goes to infinity. Let β = β(κ) be the infimum of s such that fκ(s) > 0. S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00467-8